Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme

Given a decomposable graph, we characterize and enumerate the set of pairs of vertices whose connection or disconnection results in a new graph that is also decomposable. We discuss the relevance of this results to Markov chain Monte Carlo methods that sample or optimize over the space of decomposable graphical models according to probabilities determined by a posterior distribution given obser...

متن کامل

Enumerating the junction trees of a decomposable graph.

We derive methods for enumerating the distinct junction tree representations for any given decomposable graph. We discuss the relevance of the method to estimating conditional independence graphs of graphical models and give an algorithm that, given a junction tree, will generate uniformly at random a tree from the set of those that represent the same graph. Programs implementing these methods ...

متن کامل

A decomposable graph and its subgraphs

We explore the properties of subgraphs (called Markovian subgraphs) of a decomposable graph under some condition. For a decomposable graph G and a collection γ of its Markovian subgraphs, we show that the set χ(G) of the intersections of all the neighboring cliques of G contains ∪g∈γχ(g). We also show that χ(G) = ∪g∈γχ(g) holds for a certain type of G which we call a maximal Markovian supergrap...

متن کامل

Decomposable Choice under Uncertainty

Savage motivated his sure thing principle by arguing that, whenever an act would be preferred if an event obtains and preferred if that event did not obtain, it should be preferred overall. The ability to decompose and recompose decision problems in this way has normative appeal. It does not, however, require the full separability embodied in Savage's axiom. We formulate a weaker axiom that suf...

متن کامل

On the decomposable numerical range of operators

 ‎Let $V$ be an $n$-dimensional complex inner product space‎. ‎Suppose‎ ‎$H$ is a subgroup of the symmetric group of degree $m$‎, ‎and‎ ‎$chi‎ :‎Hrightarrow mathbb{C} $ is an irreducible character (not‎ ‎necessarily linear)‎. ‎Denote by $V_{chi}(H)$ the symmetry class‎ ‎of tensors associated with $H$ and $chi$‎. ‎Let $K(T)in‎ (V_{chi}(H))$ be the operator induced by $Tin‎ ‎text{End}(V)$‎. ‎Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Statistics & Data Analysis

سال: 2009

ISSN: 0167-9473

DOI: 10.1016/j.csda.2008.10.029